Computer - Assisted Veri cation ofan Algorithm for

نویسندگان

  • Tsvetomir P. Petrov
  • Anna Pogosyants
  • Stephen J. Garland
  • Victor Luchangco
  • Nancy A. Lynch
چکیده

A formal representation and machine-checked proof are given for the Bounded Concurrent Timestamp (BCTS) algorithm of Dolev and Shavit. The proof uses invariant assertions and a forward simulation mapping to a corresponding Unbounded Concurrent Timestamp (UCTS) algorithm, following a strategy developed by Gawlick, Lynch, and Shavit. The proof was produced interactively, using the Larch Prover.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanical Veri cation of a Generalized Protocol for Byzantine Fault Tolerant Clock Synchronization

Schneider [Sch87] generalizes a number of protocols for Byzantine faulttolerant clock synchronization and presents a uniform proof for their correctness. We present a mechanical veri cation of Schneider's protocol leading to several signi cant clari cations and revisions. The veri cation was carried out with the Ehdm system [RvHO91] developed at the SRI Computer Science Laboratory. The mechanic...

متن کامل

Comparing HOL, MDG and VIS: A Case Study on the Veri cation of an ATM Switch Fabric

There exist a wide range of hardware veri cation tools, some based on interactive theorem proving and other more automated tools based on decision diagrams. In this paper, we compare three di erent veri cation systems covering the spectrum of today's veri cation technology. In particular, we consider HOL, MDG and VIS. HOL is an interactive theorem proving system based on higher-order logic. VIS...

متن کامل

Final Report: Development of a Practical Computer Software Verication System

The purpose of this report is to present an overview of contract W2207-7-AF78/01-SV, entitled \Development of a Practical Computer Software Veri cation System." EVES Project TR-90-5429-11 1

متن کامل

Relative Liveness From Intuition to Automated Veri cation

We point out de ciencies of previous treatments of liveness We de ne a new liveness condition in two forms one based on nite trace theory and the other on automata We prove the equivalence of these two de nitions We also intro duce a safety condition and provide modular and hierarchical veri cation theorems for both safety and liveness Finally we present a veri cation algorithm for liveness Ind...

متن کامل

Formal Veri cation of Scalable NonZero Indicators

Concurrent algorithms are notoriously dif cult to design correctly, and high performance algorithms that make little or no use of locks even more so. In this paper, we describe a formal veri cation of a recent concurrent data structure Scalable NonZero Indicators. The algorithm supports incrementing, decrementing, and querying the shared counter in an ef cient and linearizable way without block...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996